1698A - XOR Mixup - CodeForces Solution


bitmasks brute force *800

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    input()
    a = input().split()
    print(a[0])

C++ Code:

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define no cout << "NO" << endl
#define yes cout << "YES" << endl

typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif


void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}


void solve()
{
   int x;
   cin>>x;

   int ans ;
   cin>>ans;
   x--;
    int k;

   while (x--)
   {
    cin>>k;
   }

   cout<<k<<endl;
   
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int tc;
    cin >> tc;
    while (tc--)
    solve();
}


Comments

Submit
0 Comments
More Questions

Differences of the permutations
Doctor's Secret
Back to School
I am Easy
Teddy and Tweety
Partitioning binary strings
Special sets
Smallest chosen word
Going to office
Color the boxes
Missing numbers
Maximum sum
13 Reasons Why
Friend's Relationship
Health of a person
Divisibility
A. Movement
Numbers in a matrix
Sequences
Split houses
Divisible
Three primes
Coprimes
Cost of balloons
One String No Trouble
Help Jarvis!
Lift queries
Goki and his breakup
Ali and Helping innocent people
Book of Potion making